quotient automaton - перевод на русский
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

quotient automaton - перевод на русский


quotient automaton         
  • 243x29px
  • 177x54px
  • 126x54px
  • 60x81px

математика

фактор-автомат

quotient topology         
  • For example, <math>[0,1]/\{0,1\}</math> is homeomorphic to the circle <math>S^1.</math>
  • frameless
TOPOLOGICAL SPACE CONSISTING OF EQUIVALENCE CLASSES OF POINTS IN ANOTHER TOPOLOGICAL SPACE
Quotient topology; Quotient (topology); Quotient map; Identification space; Identification map; Quotient topological space; Gluing (topology); Identifiation map; Hereditarily quotient map

математика

фактор-топология

identification map         
  • For example, <math>[0,1]/\{0,1\}</math> is homeomorphic to the circle <math>S^1.</math>
  • frameless
TOPOLOGICAL SPACE CONSISTING OF EQUIVALENCE CLASSES OF POINTS IN ANOTHER TOPOLOGICAL SPACE
Quotient topology; Quotient (topology); Quotient map; Identification space; Identification map; Quotient topological space; Gluing (topology); Identifiation map; Hereditarily quotient map

общая лексика

отображение отождествления или идентифицирующее отображение

Определение

cellular automaton
<algorithm, parallel> (CA, plural "- automata") A regular spatial lattice of "cells", each of which can have any one of a finite number of states. The state of all cells in the lattice are updated simultaneously and the state of the entire lattice advances in discrete time steps. The state of each cell in the lattice is updated according to a local rule which may depend on the state of the cell and its neighbors at the previous time step. Each cell in a cellular automaton could be considered to be a finite state machine which takes its neighbours' states as input and outputs its own state. The best known example is J.H. Conway's game of Life. {FAQ (http://alife.santafe.edu/alife/topics/cas/ca-faq/ca-faq.html)}. Usenet newsgroups: news:comp.theory.cell-automata, news:comp.theory.self-org-sys. (1995-03-03)

Википедия

Quotient automaton
In computer science, in particular in formal language theory, a quotient automaton can be obtained from a given nondeterministic finite automaton by joining some of its states. The quotient recognizes a superset of the given automaton; in some cases, handled by the Myhill–Nerode theorem, both languages are equal.
Как переводится quotient automaton на Русский язык